Global Residues for Sparse Polynomial Systems
نویسنده
چکیده
We consider families of sparse Laurent polynomials f1, . . . , fn with a finite set of common zeroes Zf in the torus T n = (C − {0}) . The global residue assigns to every Laurent polynomial g the sum of its Grothendieck residues over Zf . We present a new symbolic algorithm for computing the global residue as a rational function of the coefficients of the fi when the Newton polytopes of the fi are full-dimensional. Our results have consequences in sparse polynomial interpolation and lattice point enumeration in Minkowski sums of polytopes.
منابع مشابه
Residues and Resultants
Resultants, Jacobians and residues are basic invariants of multivariate polynomial systems. We examine their interrelations in the context of toric geometry. The global residue in the torus, studied by Khovanskii, is the sum over local Grothendieck residues at the zeros of n Laurent polynomials in n variables. Cox introduced the related notion of the toric residue relative to n + 1 divisors on ...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملFinding sparse solutions of systems of polynomial equations via group-sparsity optimization
The paper deals with the problem of finding sparse solutions to systems of polynomial equations possibly perturbed by noise. In particular, we show how these solutions can be recovered from group-sparse solutions of a derived system of linear equations. Then, two approaches are considered to find these group-sparse solutions. The first one is based on a convex relaxation resulting in a second-o...
متن کاملSparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
This paper discusses how to find the global minimum of functions that are summations of small polynomials (“small” means involving a small number of variables). Some sparse sum of squares (SOS) techniques are proposed. We compare their computational complexity and lower bounds with prior SOS relaxations. Under certain conditions, we also discuss how to extract the global minimizers from these s...
متن کاملSparse SOS Relaxations for Minimizing Functions that are Summation of Small Polynomials
This paper discusses how to find the global minimum and minimizers of functions that are given as the summation of small polynomials (“small” means involving a small number of variables). Some sparse sum of squares (SOS) relaxations are proposed. We compare the computational complexity and lower bound with prior SOS relaxations. The proposed methods are specially useful in solving nonlinear lea...
متن کامل